Error performance of Tunstall coding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigation of the Error Performance of Tunstall Coding

A lossless data compression algorithm takes a string of symbols and encodes it as a string of bits, such that the average number of bits required is less than that in the uncoded case, where all source symbols are represented by equal length codewords. Compression algorithms are only possible when some strings or some symbols in the input stream are more probable than others; these would be enc...

متن کامل

Seismographic Data Compression --Applying Modified Tunstall Coding--

The Standard for the Exchange of Earthquake Data (SEED) is a commonly used file format in the seismology field. Steim1 and Steim2 compression schemes, i.e. lossless data compressions, are used in SEED format and are written in Data Description Language (DDL), which has computational limitations making it difficult to implement many standard compression algorithms. Steim1 and Steim2 are fixed co...

متن کامل

Performance Evaluation of Spread Spectrum Watermarking using Error Control Coding

This paper proposes an oblivious watermarking algorithm with blind detection approach for high volume data hiding in image signals. We present a detection reliable signal adaptive embedding scheme for multiple messages in selective sub-bands of wavelet (DWT) coefficients using direct sequence spread spectrum (DS-SS) modulation technique. Here the impact of volumetric distortion sources is analy...

متن کامل

On improving Tunstall codes

Though many compression methods are based on the use of variable length codes, there has recently been a trend to search for alternatives in which the lengths of the codewords are more restricted, which can be useful for fast decoding and compressed searches. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using new heurist...

متن کامل

On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources

The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average cod...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics Letters

سال: 1999

ISSN: 0013-5194

DOI: 10.1049/el:19991365